Computing the Visibility Polygons of the Endpoints of a Set of Line Segments in Output Sensitive Time
نویسندگان
چکیده
Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depthrst search. One extension of this result is an e cient algorithm for computing the full visibility graph of S, in which vertices correspond to segments and a pair of vertices are joined by an edge if the corresponding line segments are somewhere visible.
منابع مشابه
Weak visibility queries of line segments in simple polygons and polygonal domains
In this paper we consider the problem of computing the weak visibility polygon of any query line segment pq (or WVP(pq)) inside a given polygon P . Our first non-trivial algorithm runs in simple polygons and needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|). We also give an algorithm to compute the weak vi...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملThe 3d visibility complex: a unified data-structure for global visibility of scenes of polygons and smooth objects
In this paper we describe a unified data-structure, the 3D Visibility Complex which encodes the visibility information of a 3D scene of polygons and smooth convex objects. This datastructure is a partition of the maximal free segments and is based on the characterization of the topological changes of visibility along critical line sets. We show that the size k of the complex is Ω(n) and O(n) an...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملNear optimal line segment queries in simple polygons
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq)...
متن کامل